The group inverse of a triangular matrix

The inverse along a lower triangular matrix

In this paper, we investigate the recently defined notion of inverse along an element in the context of matrices over a ring. Precisely, we study the inverse of a matrix along a lower triangular matrix, under some conditions.

THE INVERSE OF THE PASCAL LOWER TRIANGULAR MATRIX MODULO p

Let L(n)p be the Pascal lower triangular matrix with coefficients `i j ́ (mod p), 0 ≤ i, j < n. In this paper, we found the inverse of L(n)p modulo p. In fact, we generalize a result due to David Callan [4].

A note on computing the inverse of a triangular Toeplitz matrix

Using trigonometric polynomial interpolation, a fast and effective numerical algorithm for computing the inverse of a triangular Toeplitz matrix with real numbers has been recently proposed [Lin et al., Theor Comp Sci 315: 511–523, 2004]. The complexity of the algorithm is two fast Fourier transforms (FFTs) and one fast cosine transform (DCT) of 2n-vectors. In this paper, we present an algorith...

Differential Polynomial Rings of Triangular Matrix Rings

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.